- Title
- Clustering with partial information
- Creator
- Bodlaender, Hans L.; Fellows, Michael R.; Heggernes, Pinar; Mancini, Frederico; Papadopoulos, Charis; Rosamond, Frances
- Relation
- Theoretical Computer Science Vol. 411, Issue 7-9, p. 1202-1211
- Publisher Link
- http://dx.doi.org/10.1016/j.tcs.2009.12.016
- Publisher
- Elsevier
- Resource Type
- journal article
- Date
- 2010
- Description
- The CORRELATION CLUSTERING problem, also known as the CLUSTER EDITING problem, seeks to edit a given graph by adding and deleting edges to obtain a collection of vertex-disjoint cliques, such that the editing cost is minimized. The EDGE CLIQUE PARTITIONING problem seeks to partition the edges of a given graph into edge-disjoint cliques, such that the number of cliques is minimized. Both problems are known to be NP-hard, and they have been previously studied with respect to approximation and fixed-parameter tractability. In this paper we study these two problems in a more general setting that we term fuzzy graphs, where the input graphs may have missing information, meaning that whether or not there is an edge between some pairs of vertices of the input graph can be undecided. For fuzzy graphs the CORRELATION CLUSTERING and EDGE CLIQUE PARTITIONING problems have previously been studied only with respect to approximation. Here we give parameterized algorithms based on kernelization for both problems. We prove that the CORRELATION CLUSTERING problem is fixed-parameter tractable on fuzzy graphs when parameterized by (k,r), where k is the editing cost and r is the minimum number of vertices required to cover the undecided edges. In particular we show that it has a polynomial-time reduction to a problem kernel on O(k²+r) vertices. We provide an analogous result for the EDGE CLIQUE PARTITIONING problem on fuzzy graphs. Using (k,r) as parameters, where k bounds the size of the partition, and r is the minimum number of vertices required to cover the undecided edges, we describe a polynomial-time kernelization to a problem kernel on O(k⁴⋅3r) vertices. This implies fixed-parameter tractability for this parameterization. Furthermore we also show that parameterizing only by the number of cliques k, is not enough to obtain fixed-parameter tractability. The problem remains, in fact, NP-hard for each fixed k > 2.
- Subject
- graphs; parameterized algorithms; cluster editing; kernels
- Identifier
- http://hdl.handle.net/1959.13/921871
- Identifier
- uon:9422
- Identifier
- ISSN:0304-3975
- Language
- eng
- Reviewed
- Hits: 3728
- Visitors: 3693
- Downloads: 0
| Thumbnail | File | Description | Size | Format |
|---|